A Generalized Least-Square Matrix Decomposition
نویسندگان
چکیده
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opinions and views of the authors, and are not the views of or endorsed by Taylor & Francis. The accuracy of the Content should not be relied upon and should be independently verified with primary sources of information. Taylor and Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content.
منابع مشابه
Singular Value Decomposition (SVD) and Generalized Singular Value Decomposition (GSVD)
The singular value decomposition (SVD) is a generalization of the eigen-decomposition which can be used to analyze rectangular matrices (the eigen-decomposition is definedonly for squaredmatrices). By analogy with the eigen-decomposition, which decomposes a matrix into two simple matrices, the main idea of the SVD is to decompose a rectangular matrix into three simple matrices: Two orthogonal m...
متن کاملThe *congruence class of the solutions of some matrix equations
The *congruence class of a least square solution for the following matrix equations AX = B, AXA = D, AXB = D and (AX XB) = (E F) is presented. Also, we derive necessary and sufficient conditions for the existence of a least square solution and present a general form of such solutions using the Singular Value Decomposition (SVD) and Generalized Singular Value Decomposition (GSVD). Crown Copyrigh...
متن کاملEla Least Squares (p,q)-orthogonal Symmetric Solutions of the Matrix Equation and Its Optimal Approximation∗
In this paper, the relationship between the (P,Q)-orthogonal symmetric and symmetric matrices is derived. By applying the generalized singular value decomposition, the general expression of the least square (P,Q)-orthogonal symmetric solutions for the matrix equation AXB = C is provided. Based on the projection theorem in inner space, and by using the canonical correlation decomposition, an ana...
متن کاملThe Canonical Generalized Polar Decomposition
The polar decomposition of a square matrix has been generalized by several authors to scalar products on Rn or Cn given by a bilinear or sesquilinear form. Previous work has focused mainly on the case of square matrices, sometimes with the assumption of a Hermitian scalar product. We introduce the canonical generalized polar decomposition A = WS, defined for general m × n matrices A, where W is...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملExplicit polar decomposition of complex matrices
In [F. Uhlig, Explicit polar decomposition and a near-characteristic polynomial: The 2 × 2 case, Linear Algebra Appl., 38:239–249, 1981], the author gives a representation for the factors of the polar decomposition of a nonsingular real square matrix of order 2. Uhlig’s formulae are generalized to encompass all nonzero complex matrices of order 2 as well as all order n complex matrices with ran...
متن کامل